R-computability and F-parameterization
نویسنده
چکیده
We compare two notions of effectiveness on uncountable structures. The first notion is that of a R-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic. The second notion is that of an F -parameterizable structure, defined by Morozov and based on Mal’tsev’s notion of a constructive structure. We show that every R-computable structure has an F -parameterization, but that the expansion of the real field by the exponential function is F parameterizable but not R-computable.
منابع مشابه
One Dimensional Invariant Manifolds of Gevrey Type in Real-analytic Maps
In this paper we study the basic questions of existence, uniqueness, differentiability, analyticity and computability of the one dimensional center manifold of a parabolic-hyperbolic fixed point of a real-analytic map. We use the parameterization method, reducing the dynamics on the center manifold to a polynomial. We prove that the asymptotic expansions of the center manifold are of Gevrey typ...
متن کاملRelative computability and uniform continuity of relations
A type-2 computable real function is necessarily continuous; and this remains true for computations relative to any oracle. Conversely, by the Weierstrass Approximation Theorem, every continuous f : [0; 1]→ R is computable relative to some oracle. In their search for a similar topological characterization of relatively computable multi-valued functions f : [0; 1] ⇒ R (also known as multi-functi...
متن کاملComputability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism
The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computability for the purpose of treating also discontinuous functions f : R → R: – non-deterministic computation; – relativized computation, specifically given access to oracles like ∅′ or ∅′′; – encoding inp...
متن کاملComplexity of Equivalence Relations and Preorders from Computability Theory
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations R,S, a componentwise reducibility is defined by R ≤ S ⇐⇒ ∃f ∀x, y [xRy ↔ f(x)Sf(y)]. Here f is taken from a suitable class of effective functions. For us the relations will be on natural numbers, and f must be computable. We show that there is a Π1-comp...
متن کاملIs It Harder to Factor a Polynomial or to Find a Root?
For a computable field F , the splitting set S is the set of polynomials p(X) ∈ F [X] which factor over F , and the root set R is the set of polynomials with roots in F . Work by Frohlich and Shepherdson essentially showed these two sets to be Turing-equivalent, surprising many mathematicians, since it is not obvious how to compute S from R. We apply other standard reducibilities from computabi...
متن کامل